Labelling Topics using Unsupervised Graph-based Methods

Tailor knowledge graph for query understanding: linking intent topics by propagation

Knowledge graphs are recently used for enriching query representations in an entity-aware way for the rich facts organized around entities in it. However, few of the methods pay attention to non-entity words and clicked websites in queries, which also help conveying user intent. In this paper, we tackle the problem of intent understanding with innovatively representing entity words, refiners an...

Predicting Topics of Scientific Papers from Co-Authorship Graphs: a Case Study

In this paper, we present a case study of predicting topics of scientific papers using a co-authorship graph. Co-authorship graphs constitute a specific view on bibliographic data, where scientific publications are modelled as a graph’s nodes, and two nodes are linked by an undirected edge whenever the two corresponding papers share at least one author. We apply a simple collective classificati...

Unsupervised deep semantic and logical analysis for identification of solution posts from community answers

These days’ discussion forums provide dependable solutions to the problems related to multiple domains and areas. However, due to the presence of huge amount of less-informative/inappropriate posts, the identification of the appropriate problem-solution pairs has become a challenging task. The emergence of a variety of topics, domains and areas has made the task of manual labelling of the probl...

TopicRank : ordonnancement de sujets pour l'extraction automatique de termes-clés

Keyphrases are single or multi-word expressions that represent the main content of a document. As keyphrases are useful in many applications such as document indexing or text summarization, and also because the vast amount of data available nowadays cannot be manually annotated, the task of automatically extracting keyphrases has attracted considerable attention. In this article we present Topi...

The Maximum Number of Edges in a Strongly Multiplicative Graph